Better Hyper-minimization - Not as Fast, But Fewer Errors
نویسنده
چکیده
Hyper-minimization aims to compute a minimal deterministic finite automaton (dfa) that recognizes the same language as a given dfa up to a finite number of errors. Algorithms for hyper-minimization that run in time O(n logn), where n is the number of states of the given dfa, have been reported recently in [Gawrychowski and Jeż: Hyperminimisation made efficient. Proc. Mfcs, Lncs 5734, 2009] and [Holzer and Maletti: An n logn algorithm for hyper-minimizing a (minimized) deterministic automaton. Theor. Comput. Sci. 411, 2010]. These algorithms are improved to return a hyper-minimal dfa that commits the least number of errors. This closes another open problem of [Badr, Geffert, and Shipman: Hyper-minimizing minimized deterministic finite state automata. Rairo Theor. Inf. Appl. 43, 2009]. Unfortunately, the time complexity for the obtained algorithm increases to O(n).
منابع مشابه
Hyper-optimization for Deterministic Tree Automata
A recent minimization technique, called hyper-minimization, permits reductions of language representations beyond the limits imposed by classical semantics-preserving minimization. Naturally, the semantics is not preserved by hyper-minimization; rather the reduced representation, which is called hyper-minimal, can accept a language that has a nite symmetric di erence to the language of the orig...
متن کاملMinimal and Hyper-Minimal Biautomata
We compare deterministic finite automata (DFAs) and biautomata under the following two aspects: structural similarities between minimal and hyper-minimal automata, and computational complexity of the minimization and hyper-minimization problem. Concerning classical minimality, the known results such as isomorphism between minimal DFAs, and NL-completeness of the DFA minimization problem carry o...
متن کاملContinuous Optimization of Hyper-Parameters
Many machine learning algorithms can be formulated as the minimization of a train ing criterion which involves training errors on each training example and some hyper parameters which are kept xed during this minimization When there is only a single hyper parameter one can easily explore how its value a ects a model selection criterion that is not the same as the training criterion and is used ...
متن کاملOptimal Hyper-Minimization
Minimal deterministic finite automata (dfas) can be reduced further at the expense of a finite number of errors. Recently, such minimization algorithms have been improved to run in time O(n logn), where n is the number of states of the input dfa, by [Gawrychowski and Jeż: Hyper-minimisation made efficient. Proc. Mfcs, Lncs 5734, 2009] and [Holzer and Maletti: An n logn algorithm for hyper-minim...
متن کاملFast Exact Matching and Correspondence with Hyper-graphs on Spatio-temporal Data
Graphs and hyper-graphs are frequently used to recognize complex and often non-rigid patterns in computer vision, either through graph matching or point-set matching with graphs. Most formulations resort to the minimization of a difficult energy function containing geometric or structural terms, frequently coupled with data attached terms involving appearance information. Traditional methods so...
متن کامل